Namık Sinan Turan, İmparatorluk ve Diplomasi: Osmanlı Diplomasisinin İzinde
نویسندگان
چکیده
منابع مشابه
1231-1235 Turan LAJP 3348:Turan
Ismayil YILMAZ 1, Ismail DEMIRYILMAZ 2, Mehmet I. TURAN 3*, Bahadır SULEYMAN 4, Isil S. TURAN 5, Durdu ALTUNER 4, Hamit H. ALP 6 & Halis SULEYMAN 4 1 Erzincan University, Faculty of Medicine, Department of Surgery, Erzincan, Turkey 2 Ibni Sina Hospital, Department of General Surgery, Kayseri, Turkey 3 Diyarbakir Research and Educational Hospital, Department of Pediatric Neurology, Diyarbakir, T...
متن کاملTuran Related Problems for Hypergraphs
For an /-uniform hypergraph 3and an integer n, the Turan number ex(n, F) for F on n vertices is denned to be the maximum size \Q\ of a hypergraph Q C [n] not containing a copy of F C2\ as a subhypergraph. For 1 = 1 and f = Kk , the complete graph on k vertices, these numbers were determined by P. Turan. However, for I > 2, and nearly any hypergraph F, the Turan problem of determining the number...
متن کاملRemembering the Good Old Days: the Ottoman Nasihatname [Advice Letters] Literature of the 17th Century
This study analyses the Ottoman Nasihatname [Advice Letters] literature of the 17th century. This tradition had its roots mainly in the so-called mirror writers of the 10th century. The chapter explores the atmosphere which allowed mirror writers to produce their work. After outlining the peculiar features of this literature and its influence on the Ottomans, it concentrates on some of the text...
متن کاملSINAN: An Argument Forwarding Multithreaded Architecture
The direct execution of data flow graphs by data flow machines exposes the maximum amount of parallelism in a computation. However, it also results in undesirable properties such as: high overhead due to data replication required to implement high fanouts in the data flow graph; poor instruction and data locality since the scheduling of ready instructions is not sensitive to data locality; and ...
متن کاملOn a Two-Sided Turan Problem
Given positive integers n, k, t, with 2 ≤ k ≤ n, and t < 2, let m(n, k, t) be the minimum size of a family F of nonempty subsets of [n] such that every k-set in [n] contains at least t sets from F , and every (k − 1)-set in [n] contains at most t− 1 sets from F . Sloan et. al [11] determined m(n, 3, 2) and Füredi et. al [6] studied m(n, 4, t) for t = 2, 3. We consider m(n, 3, t) and m(n, 4, t) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ankara Üniversitesi Dil ve Tarih-Coğrafya Fakültesi Tarih Bölümü Tarih Araştırmaları Dergisi
سال: 2015
ISSN: 1015-1826
DOI: 10.1501/tarar_0000000626